Pollinator declines and the stability of plant–pollinator networks

Population declines of pollinators constitute a major concern for the fate of biodiversity and associated ecosystem services in a context of global change. Massive declines of pollinator populations driven by habitat loss, pollution, and climate change have been reported, whose consequences at community and ecosystem levels remain elusive. We conducted a mathematical modeling and computer simulation study to assess the dynamic consequences of pollinator declines for the biodiversity of plants and pollinators. Specifically, we evaluated the effects of increased mortality and decreased carrying capacity of specialist vs. generalist and effective vs. ineffective pollinators visiting specialist vs. generalist plants on long-term community biomass and species persistence. Our results reveal that increased larval mortality and increased competition for space among larvae had the greatest impacts on the decline of pollinator diversity. In contrast, the largest sustained decreases in pollinator biomass were driven by increased adult mortality in spite of a small increase in pollinator species persistence. Decreased pollinator diversity led in turn to decreased plant diversity. Attacking pollinators with high degree and connected mostly to low-degree plants produced the greatest losses of plant diversity. Pollinator effectiveness had no noticeable effect on persistence. Our results illuminate our understanding of the consequences of pollinator declines for the maintenance of biodiversity.Fil: Ramos Jiliberto, Rodrigo. Universidad Mayor; ChileFil: Moisset de Espanés, Pablo. Centre for Biotechnology and Bioengineering; ChileFil: Vazquez, Diego P.. Universidad Nacional de Cuyo. Facultad de Ciencias Exactas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza. Instituto Argentino de Investigaciones de las Zonas Áridas. Provincia de Mendoza. Instituto Argentino de Investigaciones de las Zonas Áridas. Universidad Nacional de Cuyo. Instituto Argentino de Investigaciones de las Zonas Áridas; Argentin

Combinatorial optimization problems in self-assembly

Self-assembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate self-assembly processes will ultimately be used in circuit fabrication, nano-robotics, DNA computation, and amorphous computing. In this paper, we study two combinatorial optimization problems related to efficient self-assembly of shapes in the Tile Assembly Model of self-assembly proposed by Rothemund and Winfree [18]. The first is the Minimum Tile Set Problem, where the goal is to find the smallest tile system that uniquely produces a given shape. The second is the Tile Concentrations Problem, where the goal is to decide on the relative concentrations of different types of tiles so that a tile system assembles as quickly as possible. The first problem is akin to finding optimum program size, and the second to finding optimum running time for a "program" to assemble the shape.Self-assembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate self-assembly processes will ultimately be used in circuit fabrication, nano-robotics, DNA computation, and amorphous computing. In this paper, we study two combinatorial optimization problems related to efficient self-assembly of shapes in the Tile Assembly Model of self-assembly proposed by Rothemund and Winfree [18]. The first is the Minimum Tile Set Problem, where the goal is to find the smallest tile system that uniquely produces a given shape. The second is the Tile Concentrations Problem, where the goal is to decide on the relative concentrations of different types of tiles so that a tile system assembles as quickly as possible. The first problem is akin to finding optimum program size, and the second to finding optimum running time for a "program" to assemble the shape. We prove that the first problem is NP-complete in general, and polynomial time solvable on trees and squares. In order to prove that the problem is in NP, we present a polynomial time algorithm to verify whether a given tile system uniquely produces a given shape. This algorithm is analogous to a program verifier for traditional computational systems, and may well be of independent interest. For the second problem, we present a polynomial time $O(\log n)$-approximation algorithm that works for a large class of tile systems that we call partial order systems

VIII Encuentro de Docentes e Investigadores en Historia del Diseño, la Arquitectura y la Ciudad

Acta de congresoLa conmemoración de los cien años de la Reforma Universitaria de 1918 se presentó como una ocasión propicia para debatir el rol de la historia, la teoría y la crítica en la formación y en la práctica profesional de diseñadores, arquitectos y urbanistas. En ese marco el VIII Encuentro de Docentes e Investigadores en Historia del Diseño, la Arquitectura y la Ciudad constituyó un espacio de intercambio y reflexión cuya realización ha sido posible gracias a la colaboración entre Facultades de Arquitectura, Urbanismo y Diseño de la Universidad Nacional y la Facultad de Arquitectura de la Universidad Católica de Córdoba, contando además con la activa participación de mayoría de las Facultades, Centros e Institutos de Historia de la Arquitectura del país y la región. Orientado en su convocatoria tanto a docentes como a estudiantes de Arquitectura y Diseño Industrial de todos los niveles de la FAUD-UNC promovió el debate de ideas a partir de experiencias concretas en instancias tales como mesas temáticas de carácter interdisciplinario, que adoptaron la modalidad de presentación de ponencias, entre otras actividades. En el ámbito de VIII Encuentro, desarrollado en la sede Ciudad Universitaria de Córdoba, se desplegaron numerosas posiciones sobre la enseñanza, la investigación y la formación en historia, teoría y crítica del diseño, la arquitectura y la ciudad; sumándose el aporte realizado a través de sus respectivas conferencias de Ana Clarisa Agüero, Bibiana Cicutti, Fernando Aliata y Alberto Petrina. El conjunto de ponencias que se publican en este Repositorio de la UNC son el resultado de dos intensas jornadas de exposiciones, cuyos contenidos han posibilitado actualizar viejos dilemas y promover nuevos debates. El evento recibió el apoyo de las autoridades de la FAUD-UNC, en especial de la Secretaría de Investigación y de la Biblioteca de nuestra casa, como así también de la Facultad de Arquitectura de la UCC; va para todos ellos un especial agradecimiento

Combinatorial optimization problems in self-assembly

Self-assembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate self-assembly processes will ultimately be used in circuit fabrication, nano-robotics, DNA computation, and amorphous computing. In this paper, we study two combinatorial optimization problems related to efficient self-assembly of shapes in the Tile Assembly Model of self-assembly proposed by Rothemund and Winfree [18]. The first is the Minimum Tile Set Problem, where the goal is to find the smallest tile system that uniquely produces a given shape. The second is the Tile Concentrations Problem, where the goal is to decide on the relative concentrations of different types of tiles so that a tile system assembles as quickly as possible. The first problem is akin to finding optimum program size, and the second to finding optimu

Optimal Self-Assembly of Counters at Temperature Two

We present a tile system for assembling a counter of width K and height N = 2^K on top of a seed-row in optimum time #(N). Our counter works at temperature 2. Earlier known constructions either took sub-optimal time or required temperature 3. Using existing techniques, our system for assembling a counter from a seed row can be extended into a system for assembling an N N square in optimum time #(N) and with optimum program size #(log N/ log log N). We als

Strict Majority Bootstrap Percolation in the r-wheel

International audienceIn the strict Majority Bootstrap Percolation process each passive vertex v becomes active if at least View the MathML source⌈deg(v)+12⌉ of its neighbors are active (and thereafter never changes its state). We address the problem of finding graphs for which a small proportion of initial active vertices is likely to eventually make all vertices active. We study the problem on a ring of n vertices augmented with a "central" vertex u. Each vertex in the ring, besides being connected to u, is connected to its r closest neighbors to the left and to the right. We prove that if vertices are initially active with probability p>1/4p>1/4 then, for large values of r, percolation occurs with probability arbitrarily close to 1 as n→∞n→∞. Also, if p<1/4p<1/4, then the probability of percolation is bounded away from 1

Solving the density classification problem with a large diffusion and small amplification cellular automaton

Artículo de publicación ISIOne of the most studied inverse problems in cellular automata (CAs) is the density classification problem. It consists in finding a CA such that, given any initial configuration of 0s and 1s, it converges to the all- 1 fixed point configuration if the fraction of 1s is greater than the critical density 1/2, and it converges to the all-0 fixed point configuration otherwise. In this paper, we propose an original approach to solve this problem by designing a CA inspired by two mechanisms that are ubiquitous in nature: diffusion and nonlinear sigmoidal response. This CA, which is different from the classical ones because it has many states, has a success ratio of 100%, and works for any system size, any dimension, and any critical density